Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains

نویسندگان

  • Libin Dong
  • Rami G. Melhem
  • Daniel Mossé
چکیده

In this paper we present a time slot allocation scheme to support real-time communications with strict rate requirements and flexible distance constraints. We first devise an algorithm to schedule message streams on a single link. We then extend it to schedule real-time traffic on WDM optical star couplers, where the validation requirements of the device configuration are also taken into consideration in the scheduling algorithm. The results show that by decoupling the rate and distance constraint requirements of the realtime streams, high schedulability can be achieved with a small relative scheduling jitter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Slot Allocation for Real-Time Messages with Negotiable Distance Constraints

In this paper we present a time slot allocation scheme to support real-time communications with strict rate requirements and flexible distance constraints. We first devise an algorithm to schedule message streams on a single link. We then extend it to schedule real-time traffic on WDM optical star couplers, where the validation requirements of the device configuration are also taken into consid...

متن کامل

On Slot Reuse for Isochronous Services in DQDB Networks

Ching-Chih Hany, Chao-Ju Houz, and Kang G. Shiny yReal-Time Computing Laboratory zComputer Engineering Division Dept. of Elect. Eng. and Comput. Sci. Dept. of Elect. and Comput. Eng. The University of Michigan The University of Wisconsin Ann Arbor, MI 48109 Madison, WI 53706 fcchan,[email protected] [email protected] Abstract DQDB is a MAC protocol jointly adopted by IEEE and ANSI as the c...

متن کامل

On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks

Several access schemes have been suggested for dual-bus network topology, e.g., DQDB [32], Fasnet [37], CRMA [41], and Simple [36]. It is therefore important to provide various services in this type of networks. This paper addresses the issue of guaranteeing the timely delivery of isochronous (real-time) messages with hard deadlines in slotted dual-bus networks. We propose a slot allocation sch...

متن کامل

Cache-Conscious Memory Management

Dynamic memory allocation must solve the re-allocation problem: where to place a new object. Current techniques of malloc and GC are designed with cache locality in mind. However, it is unclear how to cleanly separate the locality effect in these techniques. This paper outlines a locality theory for dynamic memory allocation. It presents a new metric called the reallocation distance, a way to c...

متن کامل

On Slot Allocation for Time-Constrained Messages in DQDB Networks

Ching-Chih Hany, Chao-Ju Houz, and Kang G. Shiny yReal-Time Computing Laboratory zComputer Engineering Division Dept. of Elec. Eng. and Comput. Sci. Dept. of Elec. and Comput. Eng. The University of Michigan The University of Wisconsin Ann Arbor, MI 48109 Madison, WI 53706 fcchan,[email protected] [email protected] Abstract This paper addresses the issue of guaranteeing the timely delivery...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998